exhaustive attack - translation to Αγγλικά
Diclib.com
Λεξικό ChatGPT
Εισάγετε μια λέξη ή φράση σε οποιαδήποτε γλώσσα 👆
Γλώσσα:

Μετάφραση και ανάλυση λέξεων από την τεχνητή νοημοσύνη ChatGPT

Σε αυτήν τη σελίδα μπορείτε να λάβετε μια λεπτομερή ανάλυση μιας λέξης ή μιας φράσης, η οποία δημιουργήθηκε χρησιμοποιώντας το ChatGPT, την καλύτερη τεχνολογία τεχνητής νοημοσύνης μέχρι σήμερα:

  • πώς χρησιμοποιείται η λέξη
  • συχνότητα χρήσης
  • χρησιμοποιείται πιο συχνά στον προφορικό ή γραπτό λόγο
  • επιλογές μετάφρασης λέξεων
  • παραδείγματα χρήσης (πολλές φράσεις με μετάφραση)
  • ετυμολογία

exhaustive attack - translation to Αγγλικά

SET OF EVENTS WHOSE UNION COVERS THE ENTIRE SAMPLE SPACE
Collectively exhaustive; Collective Exhaustion; Collective exhaustion; Collectively Exhaustive Events; Jointly exhaustive; Jointly Exhaustive

exhaustive attack      
(brute force attack) криптоанализ методом прямого опробования (методом перебора всех возможных вариантов)
exhaustive key search         
  • GPUs]] are well-suited to the repetitive tasks associated with hardware-based password cracking
  • A single COPACOBANA board boasting 6 Xilinx Spartans – a cluster is made up of 20 of these
CRYPTANALYTIC METHOD FOR UNAUTHORIZED USERS TO ACCESS DATA VIA AN EXHAUSTIVE SEARCH
Brute force attack; Exhaustive key search; Credential recycling; Bruteforcing; Brute-force attacks; Anti-hammering
поиск ключа методом полного перебора (возмажных вариантов), переборный поиск ключа
brute force attack         
  • GPUs]] are well-suited to the repetitive tasks associated with hardware-based password cracking
  • A single COPACOBANA board boasting 6 Xilinx Spartans – a cluster is made up of 20 of these
CRYPTANALYTIC METHOD FOR UNAUTHORIZED USERS TO ACCESS DATA VIA AN EXHAUSTIVE SEARCH
Brute force attack; Exhaustive key search; Credential recycling; Bruteforcing; Brute-force attacks; Anti-hammering
криптоанализ методом прямого опробования (методом перебора всех возможных вариантов)

Ορισμός

brute force attack
<cryptography> A method of breaking a cipher (that is, to decrypt a specific encrypted text) by trying every possible key. The quicker the brute force attack, the weaker the cipher. Feasibility of brute force attack depends on the key length of the cipher, and on the amount of computational power available to the attacker. Brute force attack is impossible against the ciphers with variable-size key, such as a one-time pad cipher. {Breaking ciphers with many workstations (http://distributed.net/projects.html.en)}. (2000-01-16)

Βικιπαίδεια

Collectively exhaustive events

In probability theory and logic, a set of events is jointly or collectively exhaustive if at least one of the events must occur. For example, when rolling a six-sided die, the events 1, 2, 3, 4, 5, and 6 balls of a single outcome are collectively exhaustive, because they encompass the entire range of possible outcomes.

Another way to describe collectively exhaustive events is that their union must cover all the events within the entire sample space. For example, events A and B are said to be collectively exhaustive if

A B = S {\displaystyle A\cup B=S}

where S is the sample space.

Compare this to the concept of a set of mutually exclusive events. In such a set no more than one event can occur at a given time. (In some forms of mutual exclusion only one event can ever occur.) The set of all possible die rolls is both mutually exclusive and collectively exhaustive (i.e., "MECE"). The events 1 and 6 are mutually exclusive but not collectively exhaustive. The events "even" (2,4 or 6) and "not-6" (1,2,3,4, or 5) are also collectively exhaustive but not mutually exclusive. In some forms of mutual exclusion only one event can ever occur, whether collectively exhaustive or not. For example, tossing a particular biscuit for a group of several dogs cannot be repeated, no matter which dog snaps it up.

One example of an event that is both collectively exhaustive and mutually exclusive is tossing a coin. The outcome must be either heads or tails, or p (heads or tails) = 1, so the outcomes are collectively exhaustive. When heads occurs, tails can't occur, or p (heads and tails) = 0, so the outcomes are also mutually exclusive.

Another example of events being collectively exhaustive and mutually exclusive at same time are, event "even" (2,4 or 6) and event "odd" (1,3 or 5) in a random experiment of rolling a six-sided die. These both events are mutually exclusive because even and odd outcome can never occur at same time. The union of both "even" and "odd" events give sample space of rolling the die, hence are collectively exhaustive.

Μετάφραση του &#39exhaustive attack&#39 σε Ρωσικά